Galerkin Methods for Complementarity Problems and Variational Inequalities
نویسنده
چکیده
Complementarity problems and variational inequalities arise in a wide variety of areas, including machine learning, planning, game theory, and physical simulation. In all of these areas, to handle large-scale problem instances, we need fast approximate solution methods. One promising idea is Galerkin approximation, in which we search for the best answer within the span of a given set of basis functions. Bertsekas [1] proposed one possible Galerkin method for variational inequalities. However, this method can exhibit two problems in practice: its approximation error is worse than might be expected based on the ability of the basis to represent the desired solution, and each iteration requires a projection step that is not always easy to implement efficiently. So, in this paper, we present a new Galerkin method with improved behavior: our new error bounds depend directly on the distance from the true solution to the subspace spanned by our basis, and the only projections we require are onto the feasible region or onto the span of our basis.
منابع مشابه
Multigrid Methods for Obstacle Problems
Obstacle problems can be posed as elliptic variational inequalities, complementarity inequalities and Hamilton-Jacobi-Bellman (HJB) partial differential equations (PDEs). In this paper, we propose a multigrid algorithm based on the full approximate scheme (FAS) for solving the membrane constrained obstacle problems and the minimal surface obstacle problems in the formulations of HJB equations. ...
متن کاملForward-backward Resolvent Splitting Methods for General Mixed Variational Inequalities
We use the technique of updating the solution to suggest and analyze a class of new splitting methods for solving general mixed variational inequalities. It is shown that these modified methods converge for pseudomonotone operators, which is a weaker condition than monotonicity. Our methods differ from the known threestep forward-backward splitting of Glowinski, Le Tallec, and M. A. Noor for so...
متن کاملDiscontinuous Galerkin Methods for Solving Elliptic Variational Inequalities
We study discontinuous Galerkin methods for solving elliptic variational inequalities, of both the first and second kinds. Analysis of numerous discontinuous Galerkin schemes for elliptic boundary value problems is extended to the variational inequalities. We establish a priori error estimates for the discontinuous Galerkin methods, which reach optimal order for linear elements. Results from so...
متن کاملProjection-proximal methods for general variational inequalities
In this paper, we consider and analyze some new projection-proximal methods for solving general variational inequalities. The modified methods converge for pseudomonotone operators which is a weaker condition than monotonicity. The proposed methods include several new and known methods as special cases. Our results can be considered as a novel and important extension of the previously known res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1306.4753 شماره
صفحات -
تاریخ انتشار 2013